Comparing Partial Rankings
نویسندگان
چکیده
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other.
منابع مشابه
On sets of OT rankings
4 Partial rankings 11 4.1 Logic for partial rankings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 Entailment between partial rankings . . . . . . . . . . . . . . . . . . . . . . . . 22 4.3 Correspondence between partial rankings and tableaux . . . . . . . . . . . . . 24 4.4 Duality between partial rankings and sets of tableaux . . . . . . . . . . . . . . 27 4.5 The domai...
متن کاملRanking Stock Exchange Companies With a Combined Approach Based on FAHP-FTOPSIS Financial Ratios and Comparing Them With Tehran Stock Exchange Rankings
Ranking of companies listed on the exchange represent their status and considered a criterion for investment. Also, it increases market's competition, development and efficiency. In this study, the fifty superior companies listed in Tehran Stock Exchange were ranked based on financial ratios (liquidity, operational, leverage and profitability) using FAHP- FTOPSIS hybrid approach during the year...
متن کاملVisual Comparison of Orderings and Rankings
In many data analysis problems, sequentially ordered (or ranked) data occurs that needs to be understood and compared. Ranking information is essential in applications such as multimedia search where retrieval rankings need to be inspected; alignments of gene sequences in bio-molecular applications; or for a more abstract example, considering the permutations of rows and columns for purpose of ...
متن کاملComputing distances between partial rankings
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(n log n/ log log n) time, and the second in O(n log min{b, c}) time.
متن کاملClustering and Prediction of Rankings Within a Kemeny Distance Framework
Rankings and partial rankings are ubiquitous in data analysis, yet there is relatively little work in the classification community that uses the typical properties of rankings. We review the broader literature that we are aware of, and identify a common building block for both prediction of rankings and clustering of rankings, which is also valid for partial rankings. This building block is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006